منابع مشابه
Automatic Decidability
We give a set of inference rules with constant constraints. Then we show how to extend a set of equational clauses, so that if the application of these inference rules halts on these clauses, then the theory is decidable by applying a standard set of Paramodulation inference rules. In addition, we can determine the number of clauses generated in this decision procedure. For some theories, such ...
متن کاملGroup-theoretic orbit decidability
A recent collection of papers in the last years have given a renovated interest to the notion of orbit decidability. This is a new quite general algorithmic notion, connecting with several classical results, and closely related to the study of the conjugacy problem for extensions of groups. In the present survey we explain several of the classical results closely related to this concept, and we...
متن کاملDecidability of DPDA equivalence
A proof of decidability of equivalence between deterministic pushdown automata is presented using a mixture of methods developed in concurrency and language theory. The technique appeals to a tableau proof system for equivalence of configurations of strict deterministic grammars.
متن کاملTopological Semantics and Decidability
It is well-known that the basic modal logic of all topological spaces is S4. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal logics of T0, T1 and T2 topological spaces coincide and are S4. We also examine basic hybrid logics of these classes and prove their decidability; as part of t...
متن کاملReset nets between decidability
We study Petri nets with Reset arcs (also Transfer and Doubling arcs) in combination with other extensions of the basic Petri net model. While Reachability is undecidable in all these extensions (indeed they are Turing-powerful), we exhibit unexpected frontiers for the decid-ability of Termination, Coverability, Boundedness and place-Boundedness. In particular, we show counter-intuitive separat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1975
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(75)80060-2